Rectangle Transformation Problem
نویسندگان
چکیده
منابع مشابه
Rectangle Transformation Problem
In this paper, we propose the rectangle transformation problem (RTP) and its variants. RTP asks for a transformation by a rectangle partition between two rectangles of the same area. We are interested in the minimum RTP which requires to minimize the partition size. We mainly focus on the strict rectangle transformation problem (SRTP) in which rotation is not allowed in transforming. We show th...
متن کاملThe Runaway Rectangle Escape Problem
Motivated by the applications of routing in PCB buses, the Rectangle Escape Problem was recently introduced and studied. In this problem, we are given a set of rectangles S in a rectangular region R, and we would like to extend these rectangles to one of the four sides of R. Define the density of a point p in R as the number of extended rectangles that contain p. The question is then to find an...
متن کاملOn the Rectangle Escape Problem
Motivated by a bus routing application, we study the following rectangle escape problem: Given a set S of n rectangles inside a rectangular region R, extend each rectangle in S toward one of the four borders of R so that the maximum density over the region R is minimized, where the density of each point p ∈ R is defined as the number of extended rectangles containing p. We show that the problem...
متن کاملOn the d-Runaway Rectangle Escape Problem
In the Rectangle Escape problem, we are given a set of rectangles S in a rectangular region R, and we would like to extend these rectangles to one of the four sides of R while ensuring that the maximum number of overlaps is minimized. More formally, define the density of a point p in R as the number of extended rectangles that contain p. The question is then to find an extension with the smalle...
متن کاملHeuristics for the Rectangle Packing Problem
In this paper the rectangle packing problem (RPP) is considered. The RPP consists in finding a packing pattern of small rectangles within a larger rectangle such that the area utilization is maximized, We develop new heuristics for the RPP which are based on the G4-heuristic for the pallet loading problem. In addition to the general RPP we take also into account further restrictions which are o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2019
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-019-00563-y